A NEW SECURED VoIP USING VERIFIABLE SECRET SHARING
نویسندگان
چکیده
Voice communication carried out using the Internet Protocol (IP) for the transaction is known as Voice over Internet Protocol (VoIP). Voice over Internet Protocol is a technology for communicating using Internet protocol instead of traditional analog systems. Some VoIP services need only a regular phone connection, while others allows making telephone calls using an Internet connection instead. Some VoIP services may allows only to call other people using the same service, but others may allow to call any telephone number including local, long distance, wireless and international numbers. The fundamental idea of secret sharing is the secret message is sending through a single specified path in secured manner, so secrete sharing is must for sharing VoIP messages. There are several secret sharings used in VoIP, the most secured VoIP is Verifiable Secret Sharing (VSS). Verifiable Secret Sharing is an important primitive in distributed information that allows a dealer to share a secret among huge number of parties. Verifiable secret sharing is a way of giving information to a set of processors such that a quorum of processors is needed to access the information. VSS is a fundamental tool and distributed computing. Experimental result shows thus the proposed method of verifiable secret sharing is much secured because it overcomes the problems from packet loss, delay, security and quality.
منابع مشابه
A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملComparative Analysis and Implementation of Verifiable Secret Sharing Over a Single Path in VoIP Security with Reliable Time Delay
-------------------------------------------------------------------ABSTRACT---------------------------------------------------Voice over Internet Protocol (VoIP) is a new fancy and up growing technology. A major change in telecommunication industry in VoIP. The transmission of Real time voice data is not as easy as ordinary text data. The real time voice transmission faces lot of difficulties. ...
متن کاملA NEW SECURED VoIP USING HIERARCHICAL THRESHOLD SECRET SHARING
Voice over Internet Protocol is a category of hardware and software that enables people to use the Internet as the transmission medium for telephone calls by sending voice data in packets using IP rather than by traditional circuit transmissions of the PSTN. The transmission of real time voice data is not as easy as ordinary text data and the real time voice transmission faces lot of difficulti...
متن کاملA NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA
In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...
متن کامل